PSelInv—A Distributed Memory Parallel Algorithm for Selected Inversion
نویسندگان
چکیده
منابع مشابه
PSelInv - A Distributed Memory Parallel Algorithm for Selected Inversion: the non-symmetric Case
This paper generalizes the parallel selected inversion algorithm called PSelInv to sparse nonsymmetric matrices. We assume a general sparse matrix A has been decomposed as PAQ = LU on a distributed memory parallel machine, where L,U are lower and upper triangular matrices, and P,Q are permutation matrices, respectively. The PSelInv method computes selected elements of A. The selection is confin...
متن کاملA Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملA Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing the coloring itself in parallel. The algorithm operates in an iterative fashion; in each round vertices are speculatively colored based on limited information, and then a set of incorrectly colored vertices, to be reco...
متن کاملA Scalable Parallel Union-Find Algorithm for Distributed Memory Computers
The Union-Find algorithm is used for maintaining a number of non-overlapping sets from a finite universe of elements. The algorithm has applications in a number of areas including the computation of spanning trees, in image processing, as well as in scientific computations. Although the algorithm is inherently sequential there has been some previous efforts at constructing parallel implementati...
متن کاملA Parallel Algorithm for Connected Components on Distributed Memory Machines
Finding connected components (CC) of an undirected graph is a fundamental computational problem. Various CC algorithms exist for PRAM models. An implementation of a PRAM CC algorithm on a coarse-grain MIMD machine with distributed memory brings many problems, since the communication overhead is substantial compared to the local computation. Several implementations of CC algorithms on distribute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2017
ISSN: 0098-3500,1557-7295
DOI: 10.1145/2786977